Finding Efficient Circuits Using SAT-Solvers
نویسندگان
چکیده
In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as they are the core of the residue number system. In particular, we present a circuit of size 3n+ c over the full binary basis computing MOD3 .
منابع مشابه
MINCE: A Static Global Variable-Ordering for SAT Search and BDD Manipulation
The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of real-world instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alter...
متن کاملFinding Efficient Circuits for Ensemble Computation
Given a Boolean function as input, a fundamental problem is to find a Boolean circuit with the least number of elementary gates (AND, OR, NOT) that computes the function. The problem generalises naturally to the setting of multiple Boolean functions: find the smallest Boolean circuit that computes all the functions simultaneously. We study an NP-complete variant of this problem titled Ensemble ...
متن کاملEfficient Circuit to CNF Conversion
Modern SAT solvers are proficient at solving Boolean satisfiability problems in Conjunctive Normal Form (CNF). However, these problems mostly arise from general Boolean circuits that are then translated to CNF. We outline a simple and expressive data structure for describing arbitrary circuits, as well as an algorithm for converting circuits to CNF. Our experimental results over a large benchma...
متن کاملImprovements to Hybrid Incremental SAT Algorithms
Boolean Satisfiability (SAT) solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. SAT solvers are also the building block of more sophisticated decision procedures, including Satisfiability Modulo Theory (SMT) solvers. The large number of applications of...
متن کاملA More Efficient Parallel Unit Propagation
This work extends early work about parallel unit propagation in SAT solvers. Since CSP solvers use SAT solvers as backend, parallel solving ships with parallel SAT solvers. The parallelization is based on splitting the formula into partitions. Each thread will propagate all literals only on its private partition and communicates the found implied literals with the other threads without using lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009